Hardness Results for Multicast Cost Sharing
نویسندگان
چکیده
We continue the study of multicast cost sharing from the viewpoints of both computational complexity and economic mechanism design. We provide fundamental lower bounds on the network complexity of group-strategyproof, budget-balanced mechanisms. We also extend a classical impossibility result in game theory to show that no strategyproof mechanism can be both approximately efficient and approximately budget-balanced.
منابع مشابه
Distributed Algorithmic Mechanism Design
Distributed Algorithmic Mechanism Design Rahul Sami 2003 Distributed algorithmic mechanism design (DAMD) is an approach to designing distributed systems that takes into account both the distributed-computational environment and the incentives of autonomous agents. In this dissertation, we study two problems, multicast cost sharing and interdomain routing. We also touch upon several issues impor...
متن کاملCost Sharing Methods for Multicast Services and Probability Distribution of Shared Cost
In multicast-type services, many users share a single data flow. The question is how to split the cost of such a flow among the users. There is a need to provide users with reasonable feedback on the cost that their network usage incurs. Therefore, cost sharing methods will play an important role in multicast-type services in the future. This paper discusses cost sharing methods where many user...
متن کاملCost-based Pricing for Multicast Streaming Services
In multicast-type services, many receivers share a single data flow. The question is how to split the cost of such a flow among the receivers. There is a need to provide receivers with reasonable feedback on the cost that their network usage incurs. Therefore, cost sharing methods will play an important role in multicast-type services in the future. This paper discusses cost sharing methods whe...
متن کاملCross-sharing vs. self-sharing trees for protecting multicast sessions in mesh networks
In this study, we investigate a cost-effective approach for protecting several multicast sessions from any link failure in an optical network. The approach, referred to as cross-sharing, provides an optimal sharing of backup resources among several multicast sessions. Our cross-sharing approach employs the link-vector model, modified for multicast sessions, and provides significant cost savings...
متن کاملRobotics Nearest Neighbor Interchange and Related Distances
More and more research effort has been done to study the non-cooperative games recently. Among these various forms of games, the unicast/multicast routing game [2,5,6] and multicast cost sharing game [1,3,4] have received a considerable amount of attentions over the past few year due to its application in the Internet. However, both unicast/multicast routing game and multicast cost sharing game...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 1-3 شماره
صفحات -
تاریخ انتشار 2002